#include <vector>
using namespace std;
class Solution {
public:
    vector<int> subSort(vector<int>& array) {
        if (0 == array.size())
            return { -1,-1 };
        vector<int> v(array.begin(), array.end());
        std::sort(v.begin(), v.end());
        int m = -1, n = -1;
        for (int i = 0;i < array.size();++i)
        {
            if (v[i] != array[i])
            {
                if (-1 == m)
                    m = i;
                else
                    n = i;
            }
        }
        return { m,n };
    }
};